Cube-contractions in 3-connected quadrangulations
نویسنده
چکیده
A 3-connected quadrangulation of a closed surface is said to be K′ 3-irreducible if no faceor cube-contraction preserves simplicity and 3-connectedness. In this paper, we prove that a K′ 3-irreducible quadrangulation of a closed surface except the sphere and the projective plane is either (i) irreducible or (ii) obtained from an irreducible quadrangulation H by applying 4-cycle additions to F0 ⊆ F (H) where F (H) stands for the set of faces of H . We also determine K′ 3-irreducible quadrangulations of the sphere and the projective plane. These results imply new generating theorems of 3-connected quadrangulations of closed surfaces.
منابع مشابه
Binary Labelings for Plane Quadrangulations and their Relatives
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our labeling resembles many of the properties of Schnyder’s one for triangulations: Apart from being in bijection with tree decompositions, paths in these trees allow ...
متن کاملBinary labelings for bipartite graphs
Part of the authors introduced in [C. Huemer, S. Kappes, A binary labelling for plane Laman graphs and quadrangulations, in Proceedings of the 22nd European Workshop on Computational Geometry 83–86, 2006] a binary labeling for the angles of plane quadrangulations, similar to Schnyder labelings of the angles of plane triangulations since in both cases the labelings are equivalent to tree decompo...
متن کاملConvexity in Partial Cubes: The Hull Number
We prove that the combinatorial optimization problem of determining the hull number of a partial cube is NP-complete. This makes partial cubes the minimal graph class for which NP-completeness of this problem is known and improves earlier results in the literature. On the other hand we provide a polynomial-time algorithm to determine the hull number of planar partial cube quadrangulations. Inst...
متن کاملGeneration of simple quadrangulations of the sphere
A simple quadrangulation of the sphere is a finite simple graph embedded on the sphere such that every face is bounded by a walk of 4 edges. We consider the following classes of simple quadrangulations: arbitrary, minimum degree 3, 3-connected, and 3-connected without non-facial 4-cycles. In each case we show how the class can be generated by starting with some basic graphs in the class and app...
متن کاملImproved Compressions of Cube-Connected Cycles Networks
We present a new technique for the embedding of large cube-connected cycles networks (CCC) into smaller ones, a problem that arises when algorithms designed for an architecture of an ideal size are to be executed on an existing architecture of a xed size. Using the new embedding strategy, we show that the CCC of dimension l can be embedded into the CCC of dimension k with dilation 1 and optimum...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016